The polar-like decomposition and its applications
نویسندگان
چکیده
منابع مشابه
Computing the Polar Decomposition—with Applications
A quadratically convergent Newton method for computing the polar decomposition of a full-rank matrix is presented and analysed. Acceleration parameters are introduced so as to enhance the initial rate of convergence and it is shown how reliable estimates of the optimal parameters may be computed in practice. To add to the known best approximation property of the unitary polar factor, the Hermit...
متن کاملAn SVD-Like Matrix Decomposition and Its Applications
A matrix S ∈ C2m×2m is symplectic if SJS∗ = J , where J = [ 0 −Im Im 0 ] . Symplectic matrices play an important role in the analysis and numerical solution of matrix problems involving the indefinite inner product x∗(iJ)y. In this paper we provide several matrix factorizations related to symplectic matrices. We introduce a singular value-like decomposition B = QDS−1 for any real matrix B ∈ Rn×...
متن کاملNear Pole Polar Diagram of Points and its Duality with Applications
In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...
متن کاملPolynomial Decomposition and Its Applications
We present a simple algorithm for decomposing a polynomial H(x) into two constituent polynomials H(x) = f(g(x)), if such exist. Reversing a composition of two polynomials is shown to be reducible to a set of non-linear equations with a simple structure. While, in general, the solution of non-linear equations is quite complicated, we show that in this system the solution can be computed exactly ...
متن کاملThe Matrix Sign Decomposition and Its Relation to the Polar Decomposition
The sign function of a square matrix was introduced by Roberts in 1971. We show that it is useful to regard S = sign(A) as being part of a matrix sign decomposition A = SN, where N = (A ) ’ 1/z This decomposition leads to . the new representation sign(A) = A(A2)-‘i2. Most results for the matrix sign decomposition have a counterpart for the polar decomposition A = UH, and vice versa. To illustra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1912977w